L-functions and sum-free sets
نویسندگان
چکیده
منابع مشابه
Sum-Free Sets and Related Sets
A set A of integers is sum-free if A\(A+A) = ;. Cameron conjectured that the number of sum-free sets A f1; : : : ; Ng is O(2 N=2). As a step towards this conjecture, we prove that the number of sets A f1
متن کاملOn the exponents of APN power functions and Sidon sets, sum-free sets, and Dickson polynomials
We derive necessary conditions related to the notions, in additive combinatorics, of Sidon sets and sum-free sets, on those exponents d ∈ Z/(2 − 1)Z which are such that F (x) = x is an APN function over F2n (which is an important cryptographic property). We study to which extent these new conditions may speed up the search for new APN exponents d. We also show a new connection between APN expon...
متن کاملSmall Maximal Sum-Free Sets
Let G be a group and S a non-empty subset of G. If ab / ∈ S for any a, b ∈ S, then S is called sum-free. We show that if S is maximal by inclusion and no proper subset generates 〈S〉 then |S| ≤ 2. We determine all groups with a maximal (by inclusion) sum-free set of size at most 2 and all of size 3 where there exists a ∈ S such that a / ∈ 〈S \ {a}〉.
متن کاملSum-free Sets of Integers
A set S of integers is said to be sum-free if a, b e 5 implies a + b 6 S. In this paper, we investigate two new problems on sum-free sets: (1) Let f(k) denote the largest positive integer for which there exists a partition of (1, 2,... ,f(k)) into k sum-free sets, and let h(k) denote the largest positive integer for which there exists a partition of {1, 2, . . . , h(k)) into k sets which are su...
متن کاملCounting Generalized Sum-free Sets
We show that the number of subsets of {1, 2, ..., n} with no solution to x1+x2+ ...+xk = y1+y2+ ..+yl for k ≥ 4l−1 is at most c2 where θ = k−l k .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica Hungarica
سال: 2020
ISSN: 0236-5294,1588-2632
DOI: 10.1007/s10474-020-01055-0